Tighter representations for set partitioning problems
نویسندگان
چکیده
منابع مشابه
Tighter Representations for Set Partitioning Problems
In this paper, we consider the set partitioning polytope and we begin by applying the reformulation-linearization technique of Sherali and Adams (1990, 1994) to generate a specialized hierarchy of relaxations by exploiting the structure of this polytope. We then show that several known classes of valid inequalities for this polytopc, as well as related tightening and composition rules, are auto...
متن کاملTighter inapproximability for set cover
Set Cover is a classic NP-hard problem; as shown by Slav́ık (1997) the greedy algorithm gives an approximation ratio of lnn− ln lnn+Θ(1). A series of works by Lund & Yannakakis (1994), Feige (1998), Moshkovitz (2015) have shown that, under the assumption P 6= NP , it is impossible to obtain a polynomial-time approximation ratio with approximation ratio (1 − α) lnn, for any constant α > 0. In thi...
متن کاملSet Covering, Packing and Partitioning Problems
where A is a mxn matrix of zeroes and ones, e = (1,...,1) is a vector of m ones and c is a vector of n (arbitrary) rational components. This pure 0-1 linear programming problem is called the set covering problem. When the inequalities are replaced by equations the problem is called the set partitioning problem, and when all of the ≥ constraints are replaced by ≤ constraints, the problem is call...
متن کاملSolving Set Partitioning Problems with Constraint Programming
This paper investigates the potential of constraint programming for solving set partitioning problems occurring in crew scheduling, where constraint programming is restricted to not employ external solvers, as for instance integer linear programming solvers. We evaluate preprocessing steps known from the OR literature on moderately sized set partitioning problems. Further, we propose a new prep...
متن کاملStrong convergence for variational inequalities and equilibrium problems and representations
We introduce an implicit method for nding a common element of the set of solutions of systems of equilibrium problems and the set of common xed points of a sequence of nonexpansive mappings and a representation of nonexpansive mappings. Then we prove the strong convergence of the proposed implicit schemes to the unique solution of a variational inequality, which is the optimality condition for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00060-5